On Dranishnikov's cell-like resolution
نویسندگان
چکیده
منابع مشابه
Tree-Like Resolution Is Superpolynomially Slower Than DAG-Like Resolution for the Pigeonhole Principle
Our main result shows that a shortest proof size of tree-like resolution for the pigeonhole principle is superpolynomially larger than that of DAG-like resolution. In the proof of a lower bound, we exploit a relationship between tree-like resolution and backtracking, which has long been recognized in this eld but not been used before to give explicit results.
متن کاملA characterization of tree-like Resolution size
We explain an asymmetric Prover-Delayer game which precisely characterizes proof size in treelike Resolution. This game was previously described in a parameterized complexity context to show lower bounds for parameterized formulas [BGL11] and for the classical pigeonhole principle [BGL10]. The main point of this note is to show that the asymmetric game in fact characterizes tree-like Resolution...
متن کاملA Characterization of Tree-Like Resolution SizeI
We explain an asymmetric Prover-Delayer game which precisely characterizes proof size in tree-like Resolution. This game was previously described in a parameterized complexity context to show lower bounds for parameterized formulas [BGL13] and for the classical pigeonhole principle [BGL10]. The main point of this note is to show that the asymmetric game in fact characterizes tree-like Resolutio...
متن کاملThe Strength of Parameterized Tree-like Resolution
We examine the proof-theoretic strength of parameterized tree-like resolution—a proof system for the coW[2]complete set of parameterized tautologies. Parameterized resolution and, moreover, a general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider (FOCS’07). In that paper, Dantchev et al. show a complexity gap in parameterized tree-like resolution fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 2001
ISSN: 0166-8641
DOI: 10.1016/s0166-8641(00)00015-8